Approximations of the connection Laplacian spectra
نویسندگان
چکیده
Abstract We consider a convolution-type operator on vector bundles over metric-measure spaces. This extends the analogous convolution Laplacian functions in our earlier work to bundles, and is natural extension of graph connection Laplacian. prove that for Euclidean or Hermitian connections closed Riemannian manifolds, spectrum this both approximate
منابع مشابه
THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
متن کاملIndexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in which entries can be represented as graph structures. In our method, the topological structure of a graph as well as that of its subgraphs are represented as vectors whose components correspond to the sorted laplacian...
متن کاملVector Diffusion Maps and the Connection Laplacian.
We introduce vector diffusion maps (VDM), a new mathematical framework for organizing and analyzing massive high-dimensional data sets, images, and shapes. VDM is a mathematical and algorithmic generalization of diffusion maps and other nonlinear dimensionality reduction methods, such as LLE, ISOMAP, and Laplacian eigenmaps. While existing methods are either directly or indirectly related to th...
متن کاملOn the Laplacian Spectra of Graphs
We first establish the relationship between the largest eigenvalue of the Laplacian matrix of a graph and its bipartite density. Then we present lower and upper bounds for the largest Laplacian eigenvalue of a graph in terms of its largest degree and diameter.
متن کاملComputing the Laplacian spectra of some graphs
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as the eigenvalues of symmetric tridiagonal matrices. In addition, we apply our result to obtain an upper and lower bounds for the Laplacian-energy-like invariant of these graphs. The class of graphs considered are obtained by copies of modified generalized Bethe trees (obtained by joining the vertice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2022
ISSN: ['1432-1823', '0025-5874']
DOI: https://doi.org/10.1007/s00209-022-03016-5